منابع مشابه
Lower bounds on the signed (total) $k$-domination number
Let $G$ be a graph with vertex set $V(G)$. For any integer $kge 1$, a signed (total) $k$-dominating functionis a function $f: V(G) rightarrow { -1, 1}$ satisfying $sum_{xin N[v]}f(x)ge k$ ($sum_{xin N(v)}f(x)ge k$)for every $vin V(G)$, where $N(v)$ is the neighborhood of $v$ and $N[v]=N(v)cup{v}$. The minimum of the values$sum_{vin V(G)}f(v)$, taken over all signed (total) $k$-dominating functi...
متن کاملWalker : Lower Bounds on Functional Units
|This paper presents a new polynomial-time algorithm for computing lower bounds on the number of functional units (FUs) of each type required to schedule a data ow graph in a speci ed number of control steps. A formal approach is presented that is guaranteed to nd the tightest possible bounds that can be found by relaxing either the precedence constraints or integrality constraints on the sched...
متن کاملthe effect of functional/notional approach on the proficiency level of efl learners and its evaluation through functional test
in fact, this study focused on the following questions: 1. is there any difference between the effect of functional/notional approach and the structural approaches to language teaching on the proficiency test of efl learners? 2. can a rather innovative language test referred to as "functional test" ge devised so so to measure the proficiency test of efl learners, and thus be as much reliable an...
15 صفحه اولChaudhuri and Walker : Computing Lower Bounds on Functional Units
|This paper presents a new polynomial-time algorithm for computing lower bounds on the number of functional units (FUs) of each type required to schedule a data ow graph in a speci ed number of control steps. A formal approach is presented that is guaranteed to nd the tightest possible bounds that can be found by relaxing either the precedence constraints or integrality constraints on the sched...
متن کاملFunctional Encryption: New Perspectives and Lower Bounds
Functional encryption is an emerging paradigm for publickey encryption that enables fine-grained control of access to encrypted data. In this work, we present new lower bounds and impossibility results on functional encryption, as well as new perspectives on security definitions. Our main contributions are as follows: – We show that functional encryption schemes that satisfy even a weak (non-ad...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Differential Geometry
سال: 2005
ISSN: 0022-040X
DOI: 10.4310/jdg/1143642909